Factorization of Non-Commutative Polynomials
نویسنده
چکیده
We describe an algorithm for the factorization of non-commutative polynomials over a field. The first sketch of this algorithm appeared in an unpublished manuscript (literally hand written notes) by James H. Davenport more than 20 years ago. This version of the algorithm contains some improvements with respect to the original sketch. An improved version of the algorithm has been fully implemented in the Axiom computer algebra system.
منابع مشابه
Efficient Identity Testing and Polynomial Factorization in Nonassociative Free Rings
In this paper we study arithmetic computations over non-associative, and non-commutative free polynomials ring F{x1, x2, . . . , xn}. Prior to this work, the non-associative arithmetic model of computation was considered by Hrubes, Wigderson, and Yehudayoff [HWY10]. They were interested in completeness and explicit lower bound results. We focus on two main problems in algebraic complexity theor...
متن کاملFactoring in Skew-Polynomial Rings over Finite Fields
Efficient algorithms are presented for factoring polynomials in the skew-polynomial ring F[x; σ], a non-commutative generalization of the usual ring of polynomials F[x], where F is a finite field and σ: F → F is an automorphism (iterated Frobenius map). Applications include fast functional decomposition algorithms for a class of polynomials in F[x] whose decompositions are “wild” and previously...
متن کاملPolynomial Decomposition Algorithms
We examine the question of when a polynomial f over a commutative ring has a nontrivial functional decomposition f = g ◦ h. Previous algorithms [2, 3, 1] are exponential-time in the worst case, require polynomial factorization, and only work over fields of characteristic 0. We present an O(n2)-time algorithm. We also show that the problem is in NC . The algorithm does not use polynomial factori...
متن کاملOn the Complexity of Noncommutative Polynomial Factorization
In this paper we study the complexity of factorization of polynomials in the free noncommutative ring F〈x1, x2, . . . , xn〉 of polynomials over the field F and noncommuting variables x1, x2, . . . , xn. Our main results are the following: • Although F〈x1, . . . , xn〉 is not a unique factorization ring, we note that variabledisjoint factorization in F〈x1, . . . , xn〉 has the uniqueness property....
متن کاملCoCoALib: A C++ Library for Computations in Commutative Algebra... and Beyond
First released in 1988, CoCoA is a special-purpose system for doingComputations in Commutative Algebra: i.e. it is a system specialized in the algorithmic treatment of polynomials. It is freely available and offers a textual interface, an Emacs mode, and a graphical user interface common to most platforms ([6]). One of the main purposes of the CoCoA system is to provide a “laboratory” for study...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1002.3180 شماره
صفحات -
تاریخ انتشار 2010